The Cross Covariogram of a Pair of Polygons Determines Both Polygons, with a Few Exceptions

نویسنده

  • GABRIELE BIANCHI
چکیده

The cross covariogram gK,L of two convex sets K and L in R n is the function which associates to each x ∈ R the volume of K ∩ (L + x). Very recently Averkov and Bianchi [AB] have confirmed Matheron’s conjecture on the covariogram problem, that asserts that any planar convex body K is determined by the knowledge of gK,K . The problem of determining the sets from their covariogram is relevant in probability, in statistical shape recognition and in the determination of the atomic structure of a quasicrystal from X-ray diffraction images. We prove that when K and L are convex polygons (and also when K and L are planar convex cones) gK,L determines both K and L, up to a described family of exceptions. These results imply that, when K and L are in these classes, the information provided by the cross covariogram is so rich as to determine not only one unknown body, as required by Matheron’s conjecture, but two bodies, with a few classified exceptions. These results are also used by Bianchi [Bia] to prove that any convex polytope P in R 3 is determined by gP,P .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

Analysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model

Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...

متن کامل

Rational billiards and flat structures

1 Polygonal billiards, rational billiards 3 1.1 Polygonal billiards . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Examples: a pair of elastic point-masses on a segment and a triple of point-masses on a circle . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Unfolding billiard trajectories, rational polygons . . . . . . . . . . . . 5 1.4 Example: billiard in the unit squar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008